Search for: All records

Abstract We present progress on three old conjectures about longest paths and cycles in graphs. The first pair of conjectures, due to Lovász from 1969 and Thomassen from 1978, respectively, states that all connected vertex‐transitive graphs contain a Hamiltonian path, and that all sufficiently large such graphs even contain a Hamiltonian cycle. The third conjecture, due to Smith from 1984, states that for in every ‐connected graph any two longest cycles intersect in at least vertices. In this paper, we prove a new lemma about the intersection of longest cycles in a graph, which can be used to improve the best known bounds toward all the aforementioned conjectures: First, we show that every connected vertex‐transitive graph on vertices contains a cycle (and hence path) of length at least , improving on from DeVos [arXiv:2302:04255, 2023]. Second, we show that in every ‐connected graph with , any two longest cycles meet in at least vertices, improving on from Chen, Faudree, and Gould [J. Combin. Theory, Ser. B,72(1998) no. 1, 143–149]. Our proof combines combinatorial arguments, computer search, and linear programming. 

Abstract Letfbe an$$L^2$$-normalized holomorphic newform of weightkon$$\Gamma _0(N) \backslash \mathbb {H}$$withNsquarefree or, more generally, on any hyperbolic surface$$\Gamma \backslash \mathbb {H}$$attached to an Eichler order of squarefree level in an indefinite quaternion algebra over$$\mathbb {Q}$$. Denote byVthe hyperbolic volume of said surface. We prove the sup-norm estimate$$\begin{align*}\| \Im(\cdot)^{\frac{k}{2}} f \|_{\infty} \ll_{\varepsilon} (k V)^{\frac{1}{4}+\varepsilon} \end{align*}$$ with absolute implied constant. For a cuspidal Maaß newform$$\varphi $$of eigenvalue$$\lambda $$on such a surface, we prove that$$\begin{align*}\|\varphi \|_{\infty} \ll_{\lambda,\varepsilon} V^{\frac{1}{4}+\varepsilon}. \end{align*}$$ We establish analogous estimates in the setting of definite quaternion algebras.